On optimal constacyclic codes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On optimal constacyclic codes

In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters. In this light, we propose constructions of families of classical block and convolutional maximum-distance-separable (MDS) constacyclic codes, as we...

متن کامل

A note on isodual constacyclic codes

Article history: Received 13 February 2014 Accepted 18 April 2014 Available online 2 June 2014 Communicated by Gary L. Mullen

متن کامل

Constacyclic Codes and Cocycles

Constacyclic codes may naturally be viewed as objects arising from the cohomological concept of a cocycle. Cohomology theory suggests a transformation which is used to show, under certain circumstances, a cyclic code of length mn over a ring R is isomorphic to the direct sum of m constacyclic codes of length n. In particular this isomorphism holds in many local rings (for example Galois rings) ...

متن کامل

Galois self-dual constacyclic codes

Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois self-dual and isometrically Galois self-dual constacyclic codes are obtained. As consequences, the results on self-dual, iso-dual and Hermitian self-dual const...

متن کامل

New linear codes from constacyclic codes

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2016

ISSN: 0024-3795

DOI: 10.1016/j.laa.2016.02.014